The Number of Certain Integral Polynomials and Nonrecursive Sets of Integers, Part 2

نویسنده

  • HARVEY M. FRIEDMAN
چکیده

We present some examples of mathematically natural nonrecursive sets of integers and relations on integers by combining results from Part 1, from recursion theory, and from the negative solution to Hilbert’s 10th Problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

Solving singular integral equations by using orthogonal polynomials

In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...

متن کامل

Numerical solution of the spread of infectious diseases mathematical model based on shifted Bernstein polynomials

The Volterra delay integral equations have numerous applications in various branches of science, including biology, ecology, physics and modeling of engineering and natural sciences. In many cases, it is difficult to obtain analytical solutions of these equations. So, numerical methods as an efficient approximation method for solving Volterra delay integral equations are of interest to many res...

متن کامل

Identities for the Classical Polynomials Through Sums of Liouville Type

Polynomials defined recursively over the integers such as Dickson polynomials, Chebychev polynomials, Fibonacci polynomials, Lucas polynomials, Bernoulli polynomials, Euler polynomials, and many others have been extensively studied in the past. Most of these polynomials have some type of relationship between them and share a large number of interesting properties. They have been also found to b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004